Comparing Similarity Measures for Original WSD Lesk Algorithm

نویسندگان

  • Sulema Torres
  • Alexander Gelbukh
چکیده

There are many similarity measures to determine the similarity relatedness between two words. Measures of similarity or relatedness are used in such applications as word sense disambiguation. One of the methods used to resolve WSD is the Lesk algorithm. The performance of this algorithm is connected with the similarity relatedness between all words in the text, i.e the success rate of WSD should increase as the similarity measure’s performance gets better. This paper presents a comparison of several similarity measures applied to WSD using the original Lesk Algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Word Sense disambiguation for Arabic language using the variants of the Lesk algorithm

In this paper, we evaluate the variants of the Lesk algorithm to disambiguate Arabic words. In the first experiment we apply the original Lesk algorithm using the dictionary as a resource. As a second experience, we add some modifications for this algorithm, using the different similarity measures to determine the similarity relatedness between two concepts in Arabic Wordnet. We attempted to fi...

متن کامل

A Comparative Evaluation of Word Sense Disambiguation Algorithms for German

The present paper explores a wide range of word sense disambiguation (WSD) algorithms for German. These WSD algorithms are based on a suite of semantic relatedness measures, including path-based, information-content-based, and gloss-based methods. Since the individual algorithms produce diverse results in terms of precision and thus complement each other well in terms of coverage, a set of comb...

متن کامل

An Enhanced Lesk Word Sense Disambiguation Algorithm through a Distributional Semantic Model

This paper describes a new Word Sense Disambiguation (WSD) algorithm which extends two well-known variations of the Lesk WSD method. Given a word and its context, Lesk algorithm exploits the idea of maximum number of shared words (maximum overlaps) between the context of a word and each definition of its senses (gloss) in order to select the proper meaning. The main contribution of our approach...

متن کامل

Improvement Wsd Dictionary Using Annotated Corpus and Testing It with Simplified Lesk Algorithm

WSD is a task with a long history in computational linguistics. It is open problem in NLP. This research focuses on increasing the accuracy of Lesk algorithm with assistant of annotated corpus using Narodowy Korpus Jezyka Polskiego (NKJP “Polish National Corpus”). The NKJP_WSI (NKJP Word Sense Inventory) is used as senses inventory. A Lesk algorithm is firstly implemented on the whole corpus (t...

متن کامل

Tool for Computer-Aided Spanish Word Sense Disambiguation

We present a system for for computer-aided WSD mark-up of texts in Spanish. The system is is based on Anaya dictionary, uses a Spanish morphological analyzer and a WSD method based on Lesk algorithm (along with the other standard strategies). This tool reduces time and effort for preparation WSD-marked corpora in Spanish. We also discuss the requirement for such type of systems, which our parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009